Great rapidity data transmission system

ABSTRACT

A data transmission system in which information originally consisting of a succession of binary elements is divided into consecutive groups having a constant number of binary elements, and in which each one of said groups is thereafter replaced, according to a predetermined relationship, by a group having a larger number of binary elements, the arrangement being such that, in the latter groups, every transition between adjacent binary elements of opposite values is preceded by at least two binary elements of the same value.

United States Patent [72] Inventors Jean A. Labeyrie 21 rue Lenotre, Vaucresson; Antonine A. Jousset. 50 Boulevard Beaumarchais, Paris; Edouard E. Asseo, 2 rue Aristide Briand, Sainte-Geuevieve-des Bois; Roger Kierbel, 40 rue Alfred de, Lozere-sur-Yvette, all 01, France [21] Appl. No. 731,831

[22] Filed May 24, 1968 [45] Patented June 22, I971 [32] Priority May 24, 1967 [33] France [31] 107702 54] GREAT RAPlDlTY DATA TRANSMISSION SYSTEM 4 Claims, 6 Drawing Figs.

[52] US. Cl... 340/347 [51] InLCl. ....H03k 13/24 [50] Field of Search 178/66, 68;

3/0 rapid/[y l? i m mm i [56] References Cited UNITED STATES PATENTS 3,439,330 4/1969 Sipress 340/146.l 3,089,134 5/1963 Robinson 340/347 3,369,222 2/1968 Webb 340/1725 Primary Examiner-Robert L. Richardson Assistant Examiner--Kenneth W. Weinstein Attorney-Holman & Stern rapidit zp loolfiloolTiTlooh iloool? PATENTED 001122 1011 SHEET 2 BF 5 e ERM tqswm Fig 6 0 rapid/1f R GREAT RAPIDITY DATA TRANSMISSION SYSTEM The present invention relates to a data transmission device with accelerated speed of transmission.

It is known that in data transmission systems the data are transmitted in "blocks" of constant length m, that is to say the blocks all comprise m recurrent binary pulses.

if the speed of transmission in bands of the binary elements I in the transmission channel used is R and if D is the distortion undergone by the signal formed by these binary elements, the ratio Z==D/R defines what is called width of the infringement zone." If one calls "transition" of a transmitted signal each change of binary value of the signal, the quantity Z defines the duration of a time interval in which the transition of the received signal can fluctuate with respect to the corresponding transition of the transmitted signal.

The width of the infringement zone defines the quality of the received signal. It depends on the speed of transmission R and consequently on the duration l/R of the binary elements constituting the signal. it will be the same, and consequently the quality of transmission will be the same, if the binary elements were made twice as long and were transmitted at double the speed.

The invention is based on the idea that, the transition being a change of binary value, is sufficiently defined by the binary elements which enclose it and that, in consequence, it must be possible to double the adjacent binary elements located on one and the other side of each transition of the signal and to transmit the totality of the signal at twice the speed. As, on an average, each signal does not contain as many transitions as binary elements, the signal resulting from the doubling of the binary elements adjacent to the transitions of an original signal will include, in a general way, less than twice the binary elements of the original signal. By transmitting the resulting signal at double the speed of the transmission speed of the original signal, the duration of transmission of the resulting signal will be, in general, shorter than the duration oftransmission of the original signal.

The object of the invention is to achieve a data transmission system in which, before transmission, the signals formed of binary elements to be transmitted undergo a doubling of the duration of the binary elements adjacent to the transitions, or, in other words, in which the binary elements enclosing the transitions are doubled.

As the number of transitions of each signal is variable, the simple doubling of the binary elements adjacent to the transitions produces signals in which the total number of binary elements is variable. Given that in the data transmission systems the total number of binary elements per signal is very generally constant, the transmission system, as it has just been set out, would not be fully satisfactory.

Another object of the invention is to achieve a data transmission system in which the original signals, having a given number of binary elements and a variable number of transitions, are transformed into signals having a number of binary elements greater than the said given number but less than its double, and the same number oftransitions.

A. The case ofsubstituted signals with a variable number of binary elements.

A simple law which would allow the data transmission system to satisfy the above conditions can be established starting from the following considerations.

Let an equiprobable" series (number of 1 equal to number of of binary elements for transmission at the speed R be, for example, the binary series S of elements (FIG. 6, line a):

This series (s contains seven transitions shown by arrows. One can transform this series into a series of 17 binary elements possessing likewise seven transitions. it suffices, in fact, to introduce at each transition of the series S a new binary element the value of which is equal to that of the binary element which precedes it. One thus obtains the series 8' as follows (FIG. 6, line b):

In this series, two transitions are, at least, always separated by two binary elements of the same value.

Such a series can be transmitted with a rapidity 2 R on condition that the distortion D remains limited.

From the fact that the series S are equiprobable, there is, on an average, one transition 01 or 10 every two binary elements. It thus results that the supplementary binary elements which one adds to obtain a series S' repeats the binary value of a binary information element every two information elements of a series S,,. In other words, to two binary elements of the series 8,, correspond on an average three binary elements of the series S transformed from the series S When, per second, 2R binary elements of the series S are transmitted, there are emitted 2 R binary elements of the series 8 all this takes place as if the series 8,, were transmitted with a rapidity(4/3) R=l .33 R.

B. The case of substituted signals with a fixed number of binary elements.

The coding law proposed above, although simple, presents the disadvantage of causing to correspond with a series 5,, of given length k, a series S the length k of which is variable according to the number of transitions which the series 5,, comprises. Now as has been said above, the binary information emitted by a data transmission system is presented in the form of blocks of constant length m. It is thus desirable, from the point of view of data transmission, for the coder of the invention to transform these blocks of length m into blocks of length n, equally constant.

To satisfy this condition, a coding law, peculiar to the invention, has been established as follows:

The message to be transmitted is supposed to have a length ma multiple of eight-and a group of eight consecutive binary elements, taken in this message, will be called hereafter character. if the message is broken down into half-characters, that is to say into groups of four consecutive binary elements, it can be written in the form:

l n n n ni l n m as n! This message thus contains A half-characters with A half-character, such as l X X X, X,-,|, offers 2"=l6 possible combinations, which are none other than the expressions, in binary notation, of the decimal numbers zero to 15.

The first stage of the coding law of the invention consists in causing to correspond, in an univocal" way, with a halfcharacter 1X X X X a series of five binary elements of the form:

l 11 h 12 13 14 I This series keeps the extreme binary elements X X, and replaces the central elements X X by a series of three elements U U U which must not contain more than a single transition.

A series of three binary elements having only 2 8 possibilities, two of which are to be eliminated from the fact that they include two transitions, the combinations U H U U to be considered can only be those contained in table I as follows.

It would seem, according to this table, that one can cause six combinations U U U,-;, to correspond with four half-characters having the same extreme elements and differing only in their central elements. In reality, if one eliminates the nonunivocal series 1X U U, U X land those of which the transitions are greater than two, one can make only four combinations U U, U correspond with the four half-characters which have the same limits.

It follows that:

1. to the four half-characters 0 0 0, 0 0 l 0, 0 1 0 0, 0 l l 0, the two limits of which are Os, one can cause the series 0 0 0 0 0,00110,01100,01110tocorrespond;

2.tothefourhalf-charactersOOO l,00l 1,0 l 0 1,01 1 l, the two limits of which are 0 and 1, one can cause the series 0 00O1,0001l,001l1,0111ltocorrespond;

3. to the four half-characters l 0 0 0, 1 0 l 0, 1 1 0 0, 1 1 l 0, the two limits of which are 1 and 0, one can cause the series 1 0000,11000,.11100,11110tocorrspond;

4.tothefourhalf-characters1001,1011,1101,1111, the two limits of which are 1 and 1, one can cause the series 1 0001,1001 1,1 100 1,1 1 1 l ltocorrespond.

It is obvious that it remains to determine the assignment of a series of five elements to a given half-character in order to establish a coding table giving satisfaction.

The process of generation of such a table will be detailed hereafter and, as it is possible, starting from the above data, to obtain several coding tables, it will be necessary to choose from among them the table which leads to a convenient realization of the coder of the invention.

In conclusion, the first transformation to which the initial message to be transmitted has been subjected, gives to the said message (2) the aspect as followS:

The series of four binary elements, such as HU X I X U ll, resulting from the above transformation, can be codedstarting from the same coding law as the half-characters of the initial message. The said series then take the form:

I n RI Js U18 m-m" This second transformation gives to the message (2) the new aspect as follows: I

The examination of (4) shows that the extreme elements X and X M can bedoubled without introducing new transitions; wheTe the definitive aspect of the transformed message given by the coder of the invention:

In conclusion, the first transformation introduces A binary elements without increasing the number of transitions of the message to be transmitted. The second transformation introduces (k-l) binary elements likewise without augmenting the number of transitions. As to the third, it introduces two binary elements, still without introducing new transitions. The coder of the invention thus transforms a message of 4A binary elements to be transmitted into a coded message of (6).+1) elements having the same number of transitions.

When, per second, 2 R binary elements of the message coded in conformity with the invention are transmitted, (FIG. 6, line 0), everything takes place as if the speed of transmission of the initial message increased by When the number of half-characters of the message to be transmitted is greater than 34, one recovers the speed indicated at paragraph (A) above, that is 1.33 R.

C. Mathematical form of the law of substitution or of coding:

The coding law previously set out can be justified theoretically as follows:

With a total of m binary elements, one can form 2" series of binary elements of m elements which are none other than the translation into a binary system of the decimal numbers 0 to (2"').

To justify the coding process of the invention while taking into account of the considerations set out in paragraph A, it is necessary to show that, starting from these 2" series, it is possible to form Ln series of n binary elements such that the transitions of these series are always separated by two binary elements of the same value. This number Ln of series can be evaluated as follows.

1. Starting from L series of (n-2) binary elements, it is possible to form L series of n binary elements satisfying the imposed conditions.

In fact, it suffices to add at the beginning of each series L two identical binary elements, of a polarity opposed to those of the two identical binary elements at the beginning of each series L 2. Starting from L series of (n-l) binary elements, it is possible to form L series of n binary elements.

In fact, it suffices to repeat the first binary element of a series L to obtain a series L,,.

Every series L,, having necessarily to satisfy these two conditions, it results that one must have the relation:

n nn+ nlz with the initial conditions:

Taking account of these conditions, one has: L,=0, L,=2, L L =4, L =6 In other words, the numbers L,, form a known series called FlBONACCl series (Leonardo FlBONACCl, Pisa 1175- 1240, Liber quadratorum).

One demonstrates that a term of the order n of this series can be determined by the formula:

"-B')/ in which a and B are the roots of the equation x'x1=and K is a constant taking account of the initial conditions.

One thus has:

TE r5561; (7) can thenbe written:

with

7 mil When n becomes great, one can use the approximate formu- 1 #5 Given that:

one can determine the relation which links the length m of the initial blocks to the length n of the transfonned blocks.

Giving the first member of the equation (10) its approximate value (9), we get:

FIGS. 4 and 5 give the logic elements which must be associated with those of the assemblage of FIG. 1 in order to double the extreme binary elements of a message to be transmitted, and

FIG. 6 is a diagram of the signals already studied in the initial consideration.

FIG. 1 represents the electronic diagram of the coder of the invention.

In this figure, the block 10 is a shift register comprising four flip-flops 11-14 and allowing of cutting up a message to be 'coded into half-characters X X X,, X

The binary elements of the message pass in series into this register 10 by the input 15. Each flip-flop is preceded by a pair of two gates, respectively 111-112, 121-122, 131-132, 141-142, which control the entrance into the shift register and the advance of one step to the interior thereof. The binary elements X after having occupied successively the flip-flops 14, 13, 12, 11, is fixed in the flip-flop 11 and, when it arrives there, the other elements X X X take position respectively in the flip-flops 12, 13 and 14 which are allocated to them.

As soon as the positioning of the four binary elements is finished, they proceed in parallel from the shift register 10 to occupy respectively the four flip-flops 21, 22, 23, 24 of the transfer-register 20. The outputs of the flip-flops 11, 12, 13, 14 of the register 10 are, for this purpose, connected respectively to the inputs of the flip-flops 21, 22, 23, 24 of the register by the intermediary of pairs of gates 211-212, 221-222, 231-232,241-242.

The outputs of the flip-flops 21-24 are connected to the input terminals 311-312, 321-322, 331-332, 341-342 of a coder 30 of classic type. Moreover, the output of the flipflop 21 is connected to the input of the flip-flop 23 by the intermediary of the gates 213-214 and the output of the flipflop 24 is connected to the flip-flop 240 by the intermediary of the gates 2401-2402.

The coder 30 is intended to provide the group U U, U starting from the group X, X and from the composition of the extreme elements X X of the input half-character. The coder 30 comprises 12 AND gates 351-362 and three OR gates 371-373. The wiring is carried out so as bring about the substitutions of Table V. Among the 12 gates, certain of them are open as a function of the group X n X that is to say of the signals appearing at the inputs 311-312 and 341-342. These gates are conveniently connected to the inputs 321- 322 and 331-332 to effect the desired substitution through the open gates. Suppose, for example, that the half-character entering is 0 l I 0 and that the flip-flops 21-24 produce a signal of l2 v. at the terminals 311, 321, 331, 341 and a signal of 0 v. at the terminals 312, 322, 332, 342 when they are in the condition zero, the signals being inverted when they are in the condition one. The AND gates 351, 352, 355, 356, 357, 358 361 are then open; one finds a signal of l2 v. at the outputs of the OR gates 371-373 and a signal of 0 v. at the terminals 441, 451, 461. The flip-flops 41, 42, 43 are then put into the one condition which gives U U ,,U,,=1 l 1.

The outputs of the coder 30 are connected respectively either directly or by the intermediary of an inverter, to the inputs 441-442, 451-452, 461-462 of the flip-flops 41, 42, 43 of the transfer-register 40 which stores, for a certain time, the binary elements U U U in order to allow the coder to carry out certain operations before their utilization.

In fact, it is first necessary: 1 v

To transfer the contents of the flip-flop 21, that is to say the binary element X into the flip-flop 23, through the gates 213-214;

to transfer the contents of the unitary memory-unit 240 which contains the binary element X of the preceding halfcharacter, into the flip-flop 22 through the gates 2403-2404.

Consequent upon these transfers, the transfer register 20 contains the binary elements:

The element X has been put into store in the flip-flop 430 through the gates 431-432. Its content is transferred from the unitary memory-unit 430 through the gates 4303- 4304, into the flip-t1op 21. At the same time, the binary element X is transferred into the unitary memory-unit 240 through the gates 2401-2402, with a view to its utilization for the following half-character.

Consequent upon the transfer from the memory-unit 430 into the flip-flop 21, the transfer-register contains the binary elements:

ums XUIIH 11 x The content of the flip-flop 41, that is to say the binary element U is transferred into the flip-flop 24, through the gates 243-244 so that the transfer register 20 contains, finally, the connecting half-character:

ri-us u-.mi 11 nll After the various preliminary operations above-mentioned, the content of the transfer register 40, that is to say U U, U which, as was seen, has been stored in anticipation, is transferred into flip-flops 56, 57, 58 of the second shift register through, respectively, the gates 563-564, 573-574, 583- 584.

Immediately thereafter, the transfer register 40 is refilled, but this time with the binary elements U U U formed by the coder 30.

These binary elements U U U are then transferred into the flip-flops 52, 53, 54 (j,the shift register 50 through, respectively, the gates 513-514, 523-524, 533- 534.

During the advancement of the shift register 50, the series of binary elementsU U U ,U,, U U emerges in series by the output 55 of the said register 50.

The functioning which has just been described takes place in nine phases. These phases are controlled by the application of pulses to the entrances of the AND gates conveniently distributed in the different registers 10, 20, 40, 50 of the coder of the invention.

These pulses are provided by a time base represented in FIG. 2 in the form of a block diagram.

In this figure, is a clock giving a train of rectangular pulses, the alternations of which are of the same duration 772 and frequency l/T=9600 Hz. (diagram 0, FIG. 3).

The clock 60 feeds in parallel two frequency dividers 61 and 64. The divider 61 gives at its output the train of rectangular pulses 0 (FIG. 3) of frequency 3200 Hz., the alterations of which are of equal duration 3T/2. The divider 64 gives at its output the train of rectangular pulses 0,, (FIG. 3) of frequency 4800 Hz., the alternations of which are of equal duration T.

Following on the divider-by-three 61 are connected, in line, a divider-by-two 62 and a divider-by-four 63. At the output of the divider 62 one obtains'a train of rectangular pulses 0,, (FIG. 3) of frequency 1600 Hz., the alternations of which are of equal duration 3T. Starting from the divider 63, one obtains four trains of rectangular pulses 9 0 0, 0 called synchro-character" (FIG. 3).

These four trains of pulses present identical characteristics but are shifted in time by 3T. They have a frequency of 400 Hz., but their alternations are of unequal duration: the positive alternation has a duration of 37, whereas the duration of the negative alternation is 21 T.

To the output of the divider-by-two 64 is connected the divider-by-two 65 which gives, at its output, a train of rectangular pulses 0,, (FIG. 3) of frequency 2400 Hz. and the alternations of which are of equal duration 2T.

This assemblage of signals allowsof characterizing nine instants r, to r, of equal duration 772 and the positions in time of which are determined by the synchro-c haracter pur es.

The synchro-character pulse 0 locates the instants r, and 1,, these being spaced by 2T. The synchro-character pulse 0 locates the instants r, and 1' these being spaced by 2T. It results therefrom that two instants, such as 0, and 0,, are spaced by 4T. The synchro-character pulses 0 and 0 are relative to the instants 1,, r, and r,, r,

The functioning of the time base being cyclic, it results from the preceding considerations that the duration of this cycle is 241.

As HO. 3 shows, each phase is materialized by eight pulses. These pulses in FIG. 3 are designated by 1, to r The advancement of the shift register 10 is ensured by the signal 0,, (1600 Hz.) which controls the pairs of AND gates 141-142, 131-132, 121-122, 111-112 the outputs of which are connected respectively to the inputs of the flip-flops 14, 13, 12, 1 1. The progression ofthe register 10 is effected on the fronts of positive polarity of the signal The advance of the shift register 50 is ensured by the signal 0,, (4800 H 2.) which controls the pairs of AND gates 581- 1? .3; 5H 2 il wbwh si -vihmh are un nct'ed respectively to the inputs or the fli rflops 5 8', 597'.

The functioning of the coder of the invention is as follows:

1. At the instant 1,, the gates 241-242, 211-212 connected respectively to the inputs of the flip-flops 24, 21 of the transfer register are open and the half-character X X X X is coded in the coder 30.

2. At the instant 1 the AND gates 431-432, 421-422, 41 1-412 connected respectively to the inputs of the flip-flops 43, 42, 41 of the transfer register are open and this register stores momentarily the binary elements 1],, U U

3. At the instant r the AND gates 213, 214 connected to the outputs of the flip-flops 21 of the transfer register 20, and the AND gates 2403-2404 connected to the outputs of the unitary memoryunit 240 are open. The binary element X is transferred into the flip-flop 23 and the binary element X is transferred into the flip-flop 22.

4. At the instant 1 the AND gates 2401-2402 connected to the inputs of the unitary memory-unit 240 and the AND gates 4303-4304 connected to the outputs of the unitary memory-unit 430 are open. One thus transfers the binary element X from the flip-flop 24 into the unitary memory-unit 240 and the binary element U ma from the unitary yunit 430 into the flip-flop 21.

5. At the instant r the AND gates 4301-4302 connected to the inputs of the unitary memory-unit 430 and the AND gates 243, 244 connected to the inputs of the flip-flop 24 are open. One thus transfers the binary element U from the flipflop 43 into the unitary memory-unit 430 and the binary element U into the flip-flop 24.

6. At the instant 1' the AND gates 583-584, 573-574, 563-564 connected respectively to the inputs of the flip-flops 58, 57, 56 of the shift register are open. One thus transfers the binary elements U U U coming from the register 40 into the said flipflops 58, 57, 56.

7. At the instant T7, the AND gates 431-432, 421-422, 411-412 of the flip-flops 43, 42, 41 are open. One thus transfers the binary elements U U U into the transfer register 40.

8. At the instant r the AND gates 533-534, 523-524, 513-514 connected respectively to the inputs of the flip-flops 53, 52, 51 of the shift register 50 are open. One thus transfers the binary elements U U U into these flip-flops 53, 52, 5 1.

To conclude, it is proper to observe that when one transmits several messages successively, one does not create discontinuity in time to separate two consecutive messages. In other words, one considers that this assemblage of messages consti tutes one and the same message. lt is thus unnecessary to double the extreme elements X and X of each message. Only the elements X of the first message and X of the last are to be doubled. m

The two phases of functioning of the coder of the invention which concern the doubling of the said elements are thus not periodic. They can therefore be achieved by means of logic components controlled by signals not coming from the time base of the coder.

These components, which have not been represented on F 16. 1 in order to simplify it, are shown in FIGS. 4 and 5.

The doubling of the element X is brought abgut:

l. by connecting momentarily the flip-flop 23 of the transfer register 20 to the flip-flop 53 of the shift register 50,

2. by blocking momentarily the transfer of the content of the flip-flops 41, 42, 43 of the transfer register 40 into the flipflops 51, 52, 53 of the shift register 50.

An instant after the beginning of the transmission of a message, the flip-flops 56, 55, 54, 53, 52, 51 of the register 50 must contain respectively the binary elements U U U X X, 0. Moreover, at the beginning of this transmission, the flipflops of the register 40 may contain a series of binary elements U U U not forming part of the message; it is not then necessary that this series is transferred inmthe register 50 .an the :mmam a; when gimme 4m: ltnitnm w w; beginning of transmission, the pulse 1,, which controls the opening of the AND gates 513, 514, 523, 524, 533, 534 is blocked by the intervention of the AND gate 500 (HO. 4) which is rendered nonpassing by the application, to one of its inputs, of an inhibiting signal of short duration at.

The same signals 0' and a are applied to the inputs of an AND gate 537. This, becoming momentarily passing, allows of deblocking the pair of AND gates 535,536 (FIG. 4) which join the flip-flop 23 to the flip-flop 53. This latter will then contain the element X which doubles the element X which, at the same moment, the flip-flop 54 contains.

At the instant 1 of the end of transmission of a message, the content of flip-flops 58, 57, 56,55, 54, 53, 52, 51 is 0, 0, g g, U lUx U ll 11 the two flip-flops 58 and 57 are thus available. Moreover, at this same instant 1' the binary element is located in the unitary memory-unit 240. It is then transferred simultaneously into the two flip-flops 57 and 58 by means of the pairs of AND gates 575-576, 585-586 (FIG. 5) which are rendered passing by the application at their inputs of the signal coming from the AND gate 580, itself rendered passing by the application, at its inputs, of signals characterizing the instant 1' and of the momentary signal B.

A numerical example of the application of the invention will now be given.

Let the message (m=l 6; )\=4) be 0110-0111-0100-0101 The application of the Table V to the half-characters gives themessagezOl l[l0-01]l[11-01]1[00-00]001 The application a second time of Table V to the frontier half-characters gives the message: 011-10001-1-11001-1-00000-001andthe doubling of the extreme bits gives the message: 0 0 1 1-1 0 0 01-1-11001-1-00000-0011 in which the clashes only serve to make comprehensible the process of formation. This message comprises 25 binary elements.

What we claim is:

1. A code converter for a data transmission system in which information supplied in the form of a train of binary signals is converted into a further binary signal train including as increased number of signals, comprising means for dividing said train into consecutive signal groups each including a constant number of signals, and means for translating each one of said groups according to a predetermined relationship into a further group of binary signals including a number of said signals larger than but less than twice said constant number, said relationship being so selected that every transition between adjacent signals of opposite value in said further train is preceded by at least two binary signals of the same value.

2. A code converter as claimed in claim 1, in which said constant signal number is equal to four, in which said predetermined relationship is so selected that the two middle binary signals in each of said first-named groups are replaced by three binary signals having only one transition between them, and that the last signal in each of said first-named signal groups and the first signal in the immediately succeeding one of latter said groups are replaced by three binary signals having only one transition between them, whereby every transition in said further train is preceded by at least two binary signals of the same value.

3. A code converter as claimed in claim 1, in which each one of said first-named signal groups includes four binary LII least two binary signals of the same value.

4. A code converter as claimed in claim 1, in which each one of said first-named binary signal groups includes a number 4A of binary signals, A being an integer number, and in which each one of said further binary signal groups includes (6A+l signals. 

1. A code converter for a data transmission system in which information supplied in the form of a train of binary signals is converted into a further binary signal train including as increased number of signals, comprising means for dividing said train into consecutive signal groups each including a constant number of signals, and means for translating each one of said groups according to a predetermined relationship into a further group of binary signals including a number of said signals larger than but less than twIce said constant number, said relationship being so selected that every transition between adjacent signals of opposite value in said further train is preceded by at least two binary signals of the same value.
 2. A code converter as claimed in claim 1, in which said constant signal number is equal to four, in which said predetermined relationship is so selected that the two middle binary signals in each of said first-named groups are replaced by three binary signals having only one transition between them, and that the last signal in each of said first-named signal groups and the first signal in the immediately succeeding one of latter said groups are replaced by three binary signals having only one transition between them, whereby every transition in said further train is preceded by at least two binary signals of the same value.
 3. A code converter as claimed in claim 1, in which each one of said first-named signal groups includes four binary signals, in which said four binary signals in each of said first-named groups are first replaced by a five-binary-signal group, and in which thereafter the last two signals in each one of latter said groups and the first two signals in the immediately succeeding one of latter said groups are replaced by a new group of five binary signals, said relationship being so selected that any transition in said further signal train in preceded by at least two binary signals of the same value.
 4. A code converter as claimed in claim 1, in which each one of said first-named binary signal groups includes a number 4 lambda of binary signals, lambda being an integer number, and in which each one of said further binary signal groups includes (6 lambda +1) signals. 